First-Order Logic Definability of Free Languages
نویسندگان
چکیده
Operator Precedence Grammars (OPGs) define a deterministic class of context-free languages, which extend input-driven languages and still enjoy many properties: they are closed w.r.t. Boolean operations, concatenation and Kleene star; the emptiness problem is decidable; they are recognized by a suitable model of pushdown automaton; they can be characterized in terms of a monadic second-order logic. Also, they admit efficient parallel parsing. In this paper we introduce a subclass of OPGs, namely Free Grammars (FrGs); we prove some of its basic properties, and that, for each such grammar G, a firstorder logic formula ψ can effectively be built so that L(G) is the set of all and only strings satisfying ψ. FrGs were originally introduced for grammatical inference of programming languages. Our result can naturally boost their applicability; to this end, a tool is made freely available for the semiautomatic construction of FrGs.
منابع مشابه
Modal definability of first-order formulas with free variables and query answering
We present an algorithmically efficient criterion of modal definability for first-order existential conjunctive formulas with several free variables. Then we apply it to establish modal definability of some family of first-order ∀∃-formulas. Finally, we use our definability results to show that, in any expressive description logic, the problem of answering modally definable conjunctive queries ...
متن کاملAutomata and Logics over Signals
We extend some of the classical connections between automata and logic due to Büchi [1] and McNaughton and Papert [2], to languages of finitely varying functions or “signals”. In particular we introduce a natural class of automata for generating finitely varying functions called ST-NFA’s, and show that it coincides in terms of language-definability with a natural monadic second-order logic inte...
متن کاملModal languages for topology: Expressivity and definability
In this paper we study the expressive power and definability for (extended) modal languages interpreted on topological spaces. We provide topological analogues of the van Benthem characterization theorem and the Goldblatt-Thomason definability theorem in terms of the well established first-order topological language Lt.
متن کاملAlgebraic Characterization of FO for Scattered Linear Orderings
We prove that for the class of sets of words indexed by countable scattered linear orderings, there is an equivalence between definability in first-order logic, star-free expressions with marked product, and recognizability by finite aperiodic semigroups which satisfy the equation xωx−ω = x. 1998 ACM Subject Classification F.4.1 Mathematical Logic; F.4.3 Formal Languages
متن کاملModal Definability over a Class of Structures with Two Equivalence Relations
More than 40 years the correspondence between modal logic and first-order logic, when they are interpreted in relational structures, is on the main stream of the investigations of many modal logicians. The most interesting in this direction is a series of results on modal and first-order definability proved by Chagrova in the 1990s. In particular, from them it follows the undecidability of both...
متن کامل